________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 12:08:04
Input Data from:  dataset166.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :300
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,164833333333333
Average f[i]   :4675
Average g[i,j] :1986,11111111111
Total demand   :16350
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	0	1	-1	2	6000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 18
> Selected Move:	3110	1	-1	7	12500


> New Y[]: 
	
	 2  3  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3110


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 81
> Selected Move:	3720	1	-1	3	16500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3720


> New S[]: 
	
	 1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 97
> Selected Move:	5480	1	-1	6	21500


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 5480


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 107
> Selected Move:	6510	3	7	13	20500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0    >new incumb.: 6510


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 101
> Selected Move:	7750	1	-1	5	24500


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  0    >new incumb.: 7750


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 111
> Selected Move:	7750	3	6	10	24000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 115
> Selected Move:	7750	3	5	16	25000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 100
> Selected Move:	7750	3	10	5	24500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 93
> Selected Move:	8330	3	3	19	24500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1    >new incumb.: 8330


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 102
> Selected Move:	8230	3	2	7	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 101
> Selected Move:	8140	3	7	4	24500


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 95
> Selected Move:	8100	3	4	15	23000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 112
> Selected Move:	8040	3	16	14	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 112
> Selected Move:	8040	3	15	2	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 102
> Selected Move:	8040	3	2	4	25000


> New Y[]: 
	
	 2  3  0  0  1  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 94
> Selected Move:	7910	3	4	18	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 112
> Selected Move:	7910	3	14	16	23000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 111
> Selected Move:	7870	1	-1	10	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 113
> Selected Move:	7900	3	18	3	27000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 107
> Selected Move:	7910	3	13	11	27000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 110
> Selected Move:	7915	3	11	15	26000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 110
> Selected Move:	7920	3	3	13	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,425

## ITERATION 23 #######################


> Neighbours evaluated; 110
> Selected Move:	7908	3	19	3	27500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 24 #######################


> Neighbours evaluated; 100
> Selected Move:	7895	3	15	18	27500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 25 #######################


> Neighbours evaluated; 99
> Selected Move:	7665	3	10	6	28000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 26 #######################


> Neighbours evaluated; 105
> Selected Move:	7710	3	18	19	27500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 27 #######################


> Neighbours evaluated; 112
> Selected Move:	7698	3	13	11	27500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 28 #######################


> Neighbours evaluated; 115
> Selected Move:	7665	3	11	15	26500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 29 #######################


> Neighbours evaluated; 115
> Selected Move:	7615	3	6	17	26000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  0  0  1  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0 
 > pw :0,46

## ITERATION 30 #######################


> Neighbours evaluated; 101
> Selected Move:	7740	3	3	13	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,465

## ITERATION 31 #######################


> Neighbours evaluated; 98
> Selected Move:	7960	4	1	13	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  3  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,47

## ITERATION 32 #######################


> Neighbours evaluated; 70
> Selected Move:	7960	4	13	15	24900


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,475

## ITERATION 33 #######################


> Neighbours evaluated; 64
> Selected Move:	7960	4	15	16	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,48

## ITERATION 34 #######################


> Neighbours evaluated; 72
> Selected Move:	7910	3	15	18	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  3  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,485

## ITERATION 35 #######################


> Neighbours evaluated; 95
> Selected Move:	7910	4	16	13	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  3  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,49

## ITERATION 36 #######################


> Neighbours evaluated; 93
> Selected Move:	7861	4	13	18	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  3  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,495

## ITERATION 37 #######################


> Neighbours evaluated; 92
> Selected Move:	7960	3	18	4	24800


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 38 #######################


> Neighbours evaluated; 61
> Selected Move:	7862	3	4	2	25200


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 39 #######################


> Neighbours evaluated; 67
> Selected Move:	7814	3	2	7	25300


> New Y[]: 
	
	 2  0  0  0  0  1  0  3  0  0  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 40 #######################


> Neighbours evaluated; 58
> Selected Move:	7670	3	7	8	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  0  0  0  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,475

## ITERATION 41 #######################


> Neighbours evaluated; 68
> Selected Move:	7670	3	13	11	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  0  0  1  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0 
 > pw :0,47

## ITERATION 42 #######################


> Neighbours evaluated; 66
> Selected Move:	7570	3	17	10	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  0  1  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 43 #######################


> Neighbours evaluated; 84
> Selected Move:	7570	3	11	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  3  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 44 #######################


> Neighbours evaluated; 82
> Selected Move:	7570	3	8	4	24800


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 45 #######################


> Neighbours evaluated; 72
> Selected Move:	7654	3	10	6	25300


> New Y[]: 
	
	 2  0  0  0  3  1  1  0  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 46 #######################


> Neighbours evaluated; 83
> Selected Move:	7610	3	4	15	25400


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,445

## ITERATION 47 #######################


> Neighbours evaluated; 101
> Selected Move:	7790	4	15	6	24600


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 48 #######################


> Neighbours evaluated; 107
> Selected Move:	7790	4	6	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,435

## ITERATION 49 #######################


> Neighbours evaluated; 101
> Selected Move:	7790	4	13	16	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,43

## ITERATION 50 #######################


> Neighbours evaluated; 105
> Selected Move:	7790	3	15	18	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,425

## ITERATION 51 #######################


> Neighbours evaluated; 103
> Selected Move:	7790	4	16	6	24600


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  0  0  0  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,42

## ITERATION 52 #######################


> Neighbours evaluated; 106
> Selected Move:	7790	4	6	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  3  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,415

## ITERATION 53 #######################


> Neighbours evaluated; 106
> Selected Move:	7570	3	6	10	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  0  0  3  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 105
> Selected Move:	7570	4	13	16	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 55 #######################


> Neighbours evaluated; 105
> Selected Move:	7570	3	18	15	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  0  0  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 56 #######################


> Neighbours evaluated; 105
> Selected Move:	7570	4	16	13	24500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  0  0  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,395

## ITERATION 57 #######################


> Neighbours evaluated; 103
> Selected Move:	7570	4	13	15	24900


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  0  0  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,39

## ITERATION 58 #######################


> Neighbours evaluated; 102
> Selected Move:	7570	3	15	11	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 59 #######################


> Neighbours evaluated; 84
> Selected Move:	7610	3	10	17	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  3  0  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1 
 > pw :0,38

## ITERATION 60 #######################


> Neighbours evaluated; 59
> Selected Move:	7600	3	17	6	25500


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 61 #######################


> Neighbours evaluated; 95
> Selected Move:	7565	4	11	6	25600


> New Y[]: 
	
	 2  0  0  0  0  1  3  0  0  0  0  1  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 62 #######################


> Neighbours evaluated; 91
> Selected Move:	7830	3	6	1	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 63 #######################


> Neighbours evaluated; 109
> Selected Move:	7830	3	16	14	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 64 #######################


> Neighbours evaluated; 105
> Selected Move:	7860	3	11	7	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  1  0  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 65 #######################


> Neighbours evaluated; 106
> Selected Move:	7720	3	14	6	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 66 #######################


> Neighbours evaluated; 117
> Selected Move:	7720	3	7	2	24500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 67 #######################


> Neighbours evaluated; 115
> Selected Move:	7720	3	2	4	24500


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 68 #######################


> Neighbours evaluated; 110
> Selected Move:	7720	3	4	11	24000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 69 #######################


> Neighbours evaluated; 109
> Selected Move:	7720	3	11	15	23000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 70 #######################


> Neighbours evaluated; 109
> Selected Move:	7820	1	-1	16	28000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,325

## ITERATION 71 #######################


> Neighbours evaluated; 115
> Selected Move:	7995	3	19	3	28000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 72 #######################


> Neighbours evaluated; 112
> Selected Move:	7950	3	15	2	29500


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 73 #######################


> Neighbours evaluated; 114
> Selected Move:	8130	3	6	10	29000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 74 #######################


> Neighbours evaluated; 104
> Selected Move:	7970	3	13	19	27500


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 75 #######################


> Neighbours evaluated; 113
> Selected Move:	7995	3	3	15	28000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 76 #######################


> Neighbours evaluated; 121
> Selected Move:	8045	3	2	11	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 77 #######################


> Neighbours evaluated; 115
> Selected Move:	8103	3	15	18	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 78 #######################


> Neighbours evaluated; 118
> Selected Move:	7950	3	11	2	28000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 79 #######################


> Neighbours evaluated; 122
> Selected Move:	7745	3	10	17	28000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 80 #######################


> Neighbours evaluated; 126
> Selected Move:	7905	3	2	11	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 81 #######################


> Neighbours evaluated; 125
> Selected Move:	7893	3	11	13	27500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 82 #######################


> Neighbours evaluated; 119
> Selected Move:	7766	4	1	19	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  1  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,365

## ITERATION 83 #######################


> Neighbours evaluated; 95
> Selected Move:	7814	3	18	15	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,37

## ITERATION 84 #######################


> Neighbours evaluated; 67
> Selected Move:	7775	4	19	17	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,375

## ITERATION 85 #######################


> Neighbours evaluated; 64
> Selected Move:	7735	4	17	5	25600


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  1  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,38

## ITERATION 86 #######################


> Neighbours evaluated; 74
> Selected Move:	7682	3	15	18	25600


> New Y[]: 
	
	 2  0  0  0  0  3  0  0  0  0  0  0  0  1  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,385

## ITERATION 87 #######################


> Neighbours evaluated; 84
> Selected Move:	7718	4	5	17	25500


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  3  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  1  0  0 
 > pw :0,39

## ITERATION 88 #######################


> Neighbours evaluated; 95
> Selected Move:	7670	3	17	9	24700


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  3  0  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,395

## ITERATION 89 #######################


> Neighbours evaluated; 101
> Selected Move:	7670	3	18	15	24700


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  3  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,4

## ITERATION 90 #######################


> Neighbours evaluated; 100
> Selected Move:	7640	3	9	14	24600


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,405

## ITERATION 91 #######################


> Neighbours evaluated; 102
> Selected Move:	7840	3	16	17	24100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,41

## ITERATION 92 #######################


> Neighbours evaluated; 103
> Selected Move:	7840	4	14	13	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  3  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,415

## ITERATION 93 #######################


> Neighbours evaluated; 94
> Selected Move:	7840	3	15	18	25000


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  3  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,41

## ITERATION 94 #######################


> Neighbours evaluated; 93
> Selected Move:	7840	4	13	14	24100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,405

## ITERATION 95 #######################


> Neighbours evaluated; 109
> Selected Move:	7640	3	17	16	24600


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,4

## ITERATION 96 #######################


> Neighbours evaluated; 105
> Selected Move:	7470	3	13	2	25100


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  0  0  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,395

## ITERATION 97 #######################


> Neighbours evaluated; 94
> Selected Move:	7510	3	14	1	23500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 98 #######################


> Neighbours evaluated; 111
> Selected Move:	7623	3	0	8	25300


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  2  0  0  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,385

## ITERATION 99 #######################


> Neighbours evaluated; 93
> Selected Move:	7740	3	2	11	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  0 
 > pw :0,38

## ITERATION 100 #######################


> Neighbours evaluated; 84
> Selected Move:	7740	3	11	13	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  0  0  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  0 
 > pw :0,375

## ITERATION 101 #######################


> Neighbours evaluated; 90
> Selected Move:	7820	3	19	3	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 102 #######################


> Neighbours evaluated; 99
> Selected Move:	8040	3	18	15	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 103 #######################


> Neighbours evaluated; 99
> Selected Move:	7931	3	16	14	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 104 #######################


> Neighbours evaluated; 93
> Selected Move:	7920	3	14	6	24800


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  2  0  0  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 105 #######################


> Neighbours evaluated; 107
> Selected Move:	7820	3	6	10	24300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 106 #######################


> Neighbours evaluated; 103
> Selected Move:	7825	1	-1	19	28300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 107 #######################


> Neighbours evaluated; 106
> Selected Move:	7823	3	8	0	26500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 108 #######################


> Neighbours evaluated; 111
> Selected Move:	7920	3	19	14	28000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 109 #######################


> Neighbours evaluated; 111
> Selected Move:	7808	3	13	19	26500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 110 #######################


> Neighbours evaluated; 118
> Selected Move:	7660	3	10	16	27000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  0  1  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,345

## ITERATION 111 #######################


> Neighbours evaluated; 118
> Selected Move:	7763	3	19	13	28500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  1  1  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0 
 > pw :0,35

## ITERATION 112 #######################


> Neighbours evaluated; 110
> Selected Move:	7745	3	14	17	27500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  1  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 113 #######################


> Neighbours evaluated; 113
> Selected Move:	7700	3	15	2	29000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 114 #######################


> Neighbours evaluated; 96
> Selected Move:	7678	4	1	2	25200


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,365

## ITERATION 115 #######################


> Neighbours evaluated; 74
> Selected Move:	7677	3	17	10	25200


> New Y[]: 
	
	 2  0  3  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 116 #######################


> Neighbours evaluated; 84
> Selected Move:	7606	3	5	19	25200


> New Y[]: 
	
	 2  0  3  1  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 117 #######################


> Neighbours evaluated; 80
> Selected Move:	7495	3	3	5	25200


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 118 #######################


> Neighbours evaluated; 82
> Selected Move:	7532	3	2	18	25100


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,385

## ITERATION 119 #######################


> Neighbours evaluated; 98
> Selected Move:	7559	3	10	6	25600


> New Y[]: 
	
	 2  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,39

## ITERATION 120 #######################


> Neighbours evaluated; 101
> Selected Move:	7517	3	18	2	25700


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 121 #######################


> Neighbours evaluated; 92
> Selected Move:	7510	3	13	18	24700


> New Y[]: 
	
	 2  0  3  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 122 #######################


> Neighbours evaluated; 99
> Selected Move:	7510	3	6	10	24200


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,405

## ITERATION 123 #######################


> Neighbours evaluated; 90
> Selected Move:	7510	4	2	16	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  1  0  0  0  0  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 124 #######################


> Neighbours evaluated; 90
> Selected Move:	7510	3	10	17	25000


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  3  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,415

## ITERATION 125 #######################


> Neighbours evaluated; 94
> Selected Move:	7545	3	18	13	26000


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  3  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 126 #######################


> Neighbours evaluated; 67
> Selected Move:	7588	3	16	14	25600


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  0  1  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 127 #######################


> Neighbours evaluated; 72
> Selected Move:	7585	3	2	4	25600


> New Y[]: 
	
	 2  0  0  0  1  1  0  0  0  0  0  0  0  1  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 128 #######################


> Neighbours evaluated; 55
> Selected Move:	7711	4	14	4	25300


> New Y[]: 
	
	 2  0  0  0  3  1  0  0  0  0  0  0  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 129 #######################


> Neighbours evaluated; 67
> Selected Move:	7666	3	4	15	25400


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,44

## ITERATION 130 #######################


> Neighbours evaluated; 99
> Selected Move:	7576	3	15	18	25600


> New Y[]: 
	
	 2  0  0  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,445

## ITERATION 131 #######################


> Neighbours evaluated; 97
> Selected Move:	7529	3	18	2	25700


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  0  0  0  0  0  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 132 #######################


> Neighbours evaluated; 71
> Selected Move:	7510	3	13	18	24700


> New Y[]: 
	
	 2  0  3  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,455

## ITERATION 133 #######################


> Neighbours evaluated; 94
> Selected Move:	7510	4	2	14	24600


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  0  0  0  0  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,46

## ITERATION 134 #######################


> Neighbours evaluated; 99
> Selected Move:	7450	3	17	10	24600


> New Y[]: 
	
	 2  0  1  0  0  1  0  0  0  0  1  0  0  0  3  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,465

## ITERATION 135 #######################


> Neighbours evaluated; 89
> Selected Move:	7510	3	14	1	23000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 136 #######################


> Neighbours evaluated; 115
> Selected Move:	7570	3	19	16	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0 
 > pw :0,475

## ITERATION 137 #######################


> Neighbours evaluated; 115
> Selected Move:	7570	3	2	13	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,47

## ITERATION 138 #######################


> Neighbours evaluated; 107
> Selected Move:	7690	3	10	12	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 139 #######################


> Neighbours evaluated; 92
> Selected Move:	7860	3	18	15	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  0  0  1  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,46

## ITERATION 140 #######################


> Neighbours evaluated; 93
> Selected Move:	7570	3	12	9	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,455

## ITERATION 141 #######################


> Neighbours evaluated; 100
> Selected Move:	7570	3	9	10	23500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,45

## ITERATION 142 #######################


> Neighbours evaluated; 105
> Selected Move:	7570	3	15	2	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 143 #######################


> Neighbours evaluated; 105
> Selected Move:	7570	3	2	3	23000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 144 #######################


> Neighbours evaluated; 100
> Selected Move:	7570	3	0	7	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  0  0  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 145 #######################


> Neighbours evaluated; 104
> Selected Move:	7970	3	10	19	24300


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 146 #######################


> Neighbours evaluated; 96
> Selected Move:	8290	3	7	2	24700


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 147 #######################


> Neighbours evaluated; 94
> Selected Move:	8120	4	2	13	25400


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  0  0  0  0  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 148 #######################


> Neighbours evaluated; 87
> Selected Move:	8122	4	13	16	25400


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  0  0  0  0  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 149 #######################


> Neighbours evaluated; 94
> Selected Move:	8040	3	16	14	25000


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  0  0  0  0  1  2  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 150 #######################


> Neighbours evaluated; 96
> Selected Move:	7958	4	14	2	25200


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 151 #######################


> Neighbours evaluated; 94
> Selected Move:	7970	3	2	7	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  2  0  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,4

## ITERATION 152 #######################


> Neighbours evaluated; 100
> Selected Move:	7770	4	7	14	25500


> New Y[]: 
	
	 0  3  0  1  0  1  0  1  0  0  0  0  0  1  2  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 153 #######################


> Neighbours evaluated; 99
> Selected Move:	7800	3	7	15	23500


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  1  2  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 154 #######################


> Neighbours evaluated; 109
> Selected Move:	7800	4	14	13	24400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  2  1  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 155 #######################


> Neighbours evaluated; 108
> Selected Move:	7800	3	14	16	23900


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 156 #######################


> Neighbours evaluated; 107
> Selected Move:	7800	4	13	15	24600


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 157 #######################


> Neighbours evaluated; 104
> Selected Move:	7800	4	15	16	23900


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,37

## ITERATION 158 #######################


> Neighbours evaluated; 105
> Selected Move:	7800	4	16	19	25000


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,365

## ITERATION 159 #######################


> Neighbours evaluated; 98
> Selected Move:	7860	3	19	12	24500


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  2  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,36

## ITERATION 160 #######################


> Neighbours evaluated; 98
> Selected Move:	7570	3	12	9	24700


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  2  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,355

## ITERATION 161 #######################


> Neighbours evaluated; 95
> Selected Move:	7657	1	-1	19	28700


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  2  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 162 #######################


> Neighbours evaluated; 111
> Selected Move:	7690	3	9	8	28800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 163 #######################


> Neighbours evaluated; 112
> Selected Move:	7740	2	3	-1	24800


> New Y[]: 
	
	 0  3  0  0  0  1  0  0  2  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0 
 > pw :0,34

## ITERATION 164 #######################


> Neighbours evaluated; 89
> Selected Move:	7766	3	8	3	25100


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 165 #######################


> Neighbours evaluated; 101
> Selected Move:	7754	3	15	2	26600


> New Y[]: 
	
	 0  3  1  2  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 166 #######################


> Neighbours evaluated; 94
> Selected Move:	7795	4	3	19	26500


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 167 #######################


> Neighbours evaluated; 90
> Selected Move:	7935	3	19	8	26300


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  2  0  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 168 #######################


> Neighbours evaluated; 101
> Selected Move:	7740	3	2	19	24300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 169 #######################


> Neighbours evaluated; 98
> Selected Move:	7740	3	13	2	24800


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  2  0  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 170 #######################


> Neighbours evaluated; 107
> Selected Move:	7740	3	2	11	24300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 171 #######################


> Neighbours evaluated; 105
> Selected Move:	7730	3	8	13	24900


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  1  0  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 172 #######################


> Neighbours evaluated; 102
> Selected Move:	7730	4	13	11	24400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  2  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 173 #######################


> Neighbours evaluated; 101
> Selected Move:	7730	4	11	16	24900


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  1  0  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 174 #######################


> Neighbours evaluated; 102
> Selected Move:	7730	3	16	14	24500


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  1  0  1  2  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,345

## ITERATION 175 #######################


> Neighbours evaluated; 102
> Selected Move:	7730	4	14	11	24900


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  2  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,34

## ITERATION 176 #######################


> Neighbours evaluated; 102
> Selected Move:	7766	3	11	15	25100


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  0  0  0  1  1  2  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,335

## ITERATION 177 #######################


> Neighbours evaluated; 103
> Selected Move:	7730	3	15	8	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 178 #######################


> Neighbours evaluated; 99
> Selected Move:	7730	3	13	11	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  1  0  0  1  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 179 #######################


> Neighbours evaluated; 107
> Selected Move:	7670	3	14	13	24800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  1  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 180 #######################


> Neighbours evaluated; 103
> Selected Move:	7714	3	19	10	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 181 #######################


> Neighbours evaluated; 104
> Selected Move:	7720	3	11	18	24300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  1  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 182 #######################


> Neighbours evaluated; 106
> Selected Move:	7820	3	10	6	24800


> New Y[]: 
	
	 0  3  0  1  0  1  1  0  2  0  0  0  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 183 #######################


> Neighbours evaluated; 106
> Selected Move:	7729	3	6	14	25300


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  2  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 184 #######################


> Neighbours evaluated; 98
> Selected Move:	7670	3	18	2	26800


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  2  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 185 #######################


> Neighbours evaluated; 103
> Selected Move:	7750	3	8	0	25000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 186 #######################


> Neighbours evaluated; 110
> Selected Move:	7880	1	-1	16	30000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 187 #######################


> Neighbours evaluated; 96
> Selected Move:	7963	3	2	18	28500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  1  1  0  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 188 #######################


> Neighbours evaluated; 114
> Selected Move:	7900	3	16	10	28000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 189 #######################


> Neighbours evaluated; 113
> Selected Move:	7688	3	10	6	28500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 190 #######################


> Neighbours evaluated; 118
> Selected Move:	7730	3	18	15	28500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,305

## ITERATION 191 #######################


> Neighbours evaluated; 115
> Selected Move:	7748	3	14	10	27500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  1  0  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,31

## ITERATION 192 #######################


> Neighbours evaluated; 113
> Selected Move:	7725	3	5	19	27500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  0  1  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 193 #######################


> Neighbours evaluated; 92
> Selected Move:	7713	3	6	16	27500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 194 #######################


> Neighbours evaluated; 105
> Selected Move:	7830	1	-1	5	31500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 195 #######################


> Neighbours evaluated; 112
> Selected Move:	7865	4	0	13	28400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  1  0  0  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,33

## ITERATION 196 #######################


> Neighbours evaluated; 113
> Selected Move:	7848	4	13	16	28400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  1  0  0  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0 
 > pw :0,335

## ITERATION 197 #######################


> Neighbours evaluated; 112
> Selected Move:	7831	3	15	18	28400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  1  0  0  1  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,34

## ITERATION 198 #######################


> Neighbours evaluated; 114
> Selected Move:	7814	4	16	13	28400


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  0  0  1  0  0  2  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,345

## ITERATION 199 #######################


> Neighbours evaluated; 113
> Selected Move:	7735	3	13	0	26000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  1  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 200 #######################


> Neighbours evaluated; 111
> Selected Move:	7720	3	10	17	26000


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  0  0  0  0  0  0  0  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  1  0 
 > pw :0,355

## ITERATION 201 #######################


> Neighbours evaluated; 122
> Selected Move:	7548	3	17	6	26500


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0  0  0  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 202 #######################


> Neighbours evaluated; 114
> Selected Move:	7730	3	3	11	28000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0 
 > pw :0,365

## ITERATION 203 #######################


> Neighbours evaluated; 120
> Selected Move:	7715	3	11	13	28000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,37

## ITERATION 204 #######################


> Neighbours evaluated; 114
> Selected Move:	7720	2	16	-1	23000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,375

## ITERATION 205 #######################


> Neighbours evaluated; 108
> Selected Move:	7550	3	6	10	22500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0 
 > pw :0,38

## ITERATION 206 #######################


> Neighbours evaluated; 108
> Selected Move:	7550	3	18	2	24000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 207 #######################


> Neighbours evaluated; 112
> Selected Move:	7615	1	-1	3	28000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  0  0  1  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 208 #######################


> Neighbours evaluated; 110
> Selected Move:	7555	3	10	6	28500


> New Y[]: 
	
	 2  3  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 209 #######################


> Neighbours evaluated; 114
> Selected Move:	7720	4	0	2	24700


> New Y[]: 
	
	 0  3  2  1  0  1  1  0  0  0  0  0  0  1  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0 
 > pw :0,4
________________________________________________________________

Best solution found: 8330
Run Termination time: 31.01.2010 12:16:17
Run duration: 00:08:13.6093750
________________________________________________________________
